Optimal layout of edge-weighted forests
نویسندگان
چکیده
منابع مشابه
Optimal Layout of Edge-weighted Forests
The layout problem for trees with weighted edges is motivated by the design of very large scale integrated circuits. Some of the nodes are xed and the object is to position the remainder so that the total weighted edge cost is minimized. The cost of each edge is the product of its weight and its length under some appropriate norm. Optimization for planar layouts is shown to be NP-hard. If cross...
متن کاملTowards optimal table layout
Tables are one of the most powerful and useful design elements in current web document standards such as (X)HTML, CSS and XSL. Importantly, designers do not need to precisely specify the width of the table columns, instead the designer may allow these to adapt to the viewing context while still preserving the general design intended by the document author. Unfortunately, however, the adaptive l...
متن کاملOn Weighted Edge-Searching
In this document we address some complications regarding the weighted edge-searching problem. This variant of edge-searching extends the original problem by considering situations where multiple searchers may be required to clear a single edge or guard a single vertex. We show that previous work on this topic overlooked a fundamental problem that arises from the addition of weights. As a conseq...
متن کاملEdge searching weighted graphs
In traditional edge searching one tries to clean all of the edges in a graph employing the least number of searchers. It is assumed that each edge of the graph initially has a weight equal to one. In this paper we modify the problem and introduce the Weighted Edge Searching Problem by considering graphswith arbitrary positive integerweights assigned to its edges. We give bounds on the weighted ...
متن کاملNode-Edge Diagram Layout for Displaying Hierarchies
This paper reports the layout generation approach used in a new technique for visualizing hierarchies which provides both focus and context visualization. The hierarchy is represented as a node-edge diagram separated in two connected sub-diagrams that show the node of interest and its context.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1999
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(98)00088-2